Some optimal codes related to graphs invariant under the alternating group $A_8$
نویسندگان
چکیده
منابع مشابه
Some optimal codes related to graphs invariant under the alternating group A8
Some optimal codes related to graphs invariant under the alternating group A8
متن کاملSome Graphs Related to Thompson's Group F
The Schreier graphs of Thompson’s group F with respect to the stabilizer of 12 and generators x0 and x1, and of its unitary representation in L2([0, 1]) induced by the standard action on the interval [0, 1] are explicitly described. The coamenability of the stabilizers of any finite set of dyadic rational numbers is established. The induced subgraph of the right Cayley graph of the positive mon...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملOn Codes that are Invariant under the Affine Group
Let k[V ] be the space of functions from a finite vector space into the algebraically closure of its field of scalars. This paper describes the lattice of subspaces of k[V ] which are invariant under the affine group AGL(V ). The description provides a simple method for finding the submodule generated by any set of functions given as polynomials in the standard coordinates.
متن کاملUni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.339